Cellular automaton for chimera states
نویسندگان
چکیده
منابع مشابه
A Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملChimera states for coupled oscillators.
Arrays of identical oscillators can display a remarkable spatiotemporal pattern in which phase-locked oscillators coexist with drifting ones. Discovered two years ago, such "chimera states" are believed to be impossible for locally or globally coupled systems; they are peculiar to the intermediate case of nonlocal coupling. Here we present an exact solution for this state, for a ring of phase o...
متن کاملMetastable Congested States in Multisegment Traffic Cellular Automaton
We investigate a simple multisegment cellular automaton model of traffic flow. With the introduction of segment-dependent acceleration probability, metastable congested states in the intermediate density region emerge, and the initial-state dependence of the flow is observed. The essential feature of three-phased structure empirically found in real-world traffic flow is reproduced without elabo...
متن کاملCellular automaton for bacterial towers
A simulation approach to the stochastic growth of bacterial towers is presented, in which a non-uniform and finite nutrient supply essentially determines the emerging structure through elementary chemotaxis. The method is based on cellular automata and we use simple, microscopic, local rules for bacterial division in nutrient-rich surroundings. Stochastic nutrient diffusion, while not crucial t...
متن کاملA Simpliied Cellular Automaton Model for City Traac a Simpliied Cellular Automaton Model for City Traac
We systematically investigate the e ect of blockage sites in a cellular automaton model for tra c ow. Di erent scheduling schemes for the blockage sites are considered. None of them returns a linear relationship between the fraction of \green" time and the throughput. We use this information for a fast implementation of a simulation of tra c in Dallas.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2016
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/114/18002